منابع مشابه
Robust Adaptive Routing Under Uncertainty
We consider the problem of finding an optimal history-dependent routing strategy on a directed graph weighted by stochastic arc costs when the decision maker is constrained by a travel-time budget and the objective is to optimize the expected value of a function of the budget overrun. Leveraging recent results related to the problem of maximizing the probability of termination within budget, we...
متن کاملRobust Inventory Routing Under Demand Uncertainty
This paper introduces a robust inventory routing problem where a supplier distributes a single product to multiple customers facing dynamic uncertain demands over a finite discrete time horizon. The probability distribution of the uncertain demand at each customer is not fully specified. The only available information is that these demands are independent and symmetric random variables which ca...
متن کاملRobust Multi-Period Vehicle Routing under Customer Order Uncertainty
In this paper, we study multi-period vehicle routing problems where the aim is to determine a minimum cost visit schedule and associated routing plan for each period using capacityconstrained vehicles. In our setting, we allow for customer service requests that are received dynamically over the planning horizon. In order to guarantee the generation of routing plans that can flexibly accommodate...
متن کاملThe Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
We study the robust capacitated vehicle routing problem (CVRP) under demand uncertainty, which determines a minimum cost delivery of a product to geographically dispersed customers using capacity-constrained vehicles. Contrary to the deterministic CVRP, which postulates that the customer demands for the product are deterministic and known, the robust CVRP models the customer demands as random v...
متن کاملRobust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty ∗
We present mixed integer linear programming models that are robust in the face of uncertain traffic demands known to lie in a certain polyhedron for the problem of dense wavelength division multiplexing network routing and provisioning at minimal cost. We investigate the solution of the problem in a set of numerical experiments for two models of polyhedral uncertainty: (a) the hose model, (b) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2018
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2017.1662